Transparent Dynamic Optimization
نویسندگان
چکیده
Dynamic optimization refers to the runtime optimization of a native program binary. This paper describes the design and implementation of Dynamo, a prototype dynamic optimizer that is capable of optimizing a native program binary at runtime. Dynamo is a realistic implementation, not a simulation, that is written entirely in user-level software, and runs on a PA-RISC machine under the HPUX operating system. Dynamo does not depend on any special programming language, compiler, operating system or hardware support. The program binary is not instrumented and is left untouched during Dynamo’s operation. Dynamo observes the program’s behavior through interpretation to dynamically select hot instruction traces from the running program. The hot traces are optimized using low-overhead optimization techniques and emitted into a software code cache. Subsequent instances of these traces cause the cached version to be executed, resulting in a performance boost. Contrary to intuition, we demonstrate that it is possible to use a piece of software to improve the performance of a native, statically optimized program binary, while it is executing. Dynamo not only speeds up real application programs, its performance improvement is often quite significant. For example, the performance of many +O2 optimized SPECint95 binaries running under Dynamo is comparable to the performance of their +O4 optimized version running without Dynamo.
منابع مشابه
Transparent Dynamic Optimization: The Design and Implementation of Dynamo
dynamic optimization, compiler, trace selection, binary translation Dynamic optimization refers to the runtime optimization of a native program binary. This report describes the design and implementation of Dynamo, a prototype dynamic optimizer that is capable of optimizing a native program binary at runtime. Dynamo is a realistic implementation, not a simulation, that is written entirely in us...
متن کاملINVESTIGATION OF PHYSICALLY AWARE ROUTING AND WAVELENGTH ASSIGNMENT (RWA) ALGORITHMS FOR NEXT GENERATION TRANSPARENT OPTICAL NETWORKS by
Optical networks form the foundation of today’s information infrastructure. Current generation optical networks consist largely of point-to-point electronically transmitted links which switch between nodes and repeaters. There is a trend in optical networking to move from the current generation opaque networks toward transparent networks. Transparent networks use only optical devices, eliminati...
متن کاملEffect of tocopherol on Pluronic microemulsions: turbidity studies and Dynamic light scattering and dynamic surface tension measurements
The development and design of the biocompatible and biodegradable thermodynamically stable micellar and microemulsion transparent dispersions to reduce the free and unbounded drugs concentration in the blood is a basic challenge in field of drug efficacy and bioavailability of drugs. In the current work, solubilization capacity of the drug (Tocopherol), oil (Ethyl Butyrate), and oil+drug (1:1 m...
متن کاملThe Dynamic Programming Equation for Second Order Stochastic Target Problems
Motivated by applications in mathematical finance [3] and stochastic analysis [16], we continue our study of second order backward stochastic equations (2BSDE). In this paper, we derive the dynamic programming equation for a certain class of problems which we call as the second order stochastic target problems. In contrast with previous formulations of similar problems, we restrict control proc...
متن کاملA tool for generating optimal control laws for hybrid electric powertrains
This paper describes the development of a tool for automatic generation of optimal power management strategies. Given the user inputs, which are dynamic vehicle model, driving cycle and optimization criterion, the tool first produces a simplified powertrain model in the form of static maps, before dynamic programming is used to find an optimal torque split which minimizes the chosen criterion. ...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999